Exact quantum algorithms have advantage for almost all Boolean functions
نویسندگان
چکیده
It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean function, up to isomorphism, that requires n queries.
منابع مشابه
Properties and Application of Nondeterministic Quantum Query Algorithms
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zeroerror, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a fresh notion in addition to already stu...
متن کاملOn completely robust path delay fault testable realization of logic functions
A large class of Boolean functions, as well as almost all symmetr ic Boolean functions, are shown to have no two-level completely robust path-delay-fault testable ( R P D F T ) realization b y combinational circuits. Exact and asymptotic formulae are derived fo r the number of symmetric Boolean functions which have two-level completely R P D F T realization. To achieve completely R P D F T real...
متن کاملQuantum advantage without entanglement
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean...
متن کاملCharacterizations of symmetrically partial Boolean functions with exact quantum query complexity
We give and prove an optimal exact quantum query algorithm with complexity k+ 1 for computing the promise problem (i.e., symmetric and partial Boolean function) DJ n defined as: DJ k n(x) = 1 for |x| = n/2, DJ n(x) = 0 for |x| in the set {0, 1, . . . , k, n − k, n − k + 1, . . . , n}, and it is undefined for the rest cases, where n is even, |x| is the Hamming weight of x. The case of k = 0 is t...
متن کاملOptimal quantum query bounds for almost all Boolean functions
We show that almost all n-bit Boolean functions have bounded-error quantum query complexity at least n/2, up to lower-order terms. This improves over an earlier n/4 lower bound of Ambainis [1], and shows that van Dam’s oracle interrogation [9] is essentially optimal for almost all functions. Our proof uses the fact that the acceptance probability of a T -query algorithm can be written as the su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 15 شماره
صفحات -
تاریخ انتشار 2015